Two hardware implementations for modular multiplication in the AMNS: Sequential and semi-parallel
نویسندگان
چکیده
We propose two hardware architectures for the modular multiplication over a finite field F p using Adapted Modular Number System (AMNS). present their optimized implementations, with low latency.
منابع مشابه
Single Base Modular Multiplication for Efficient Hardware RNS Implementations of ECC
The paper describes a new RNS modular multiplication algorithm for efficient implementations of ECC over FP . Thanks to the proposition of RNS-friendly Mersenne-like primes, the proposed RNS algorithm requires 2 times less moduli than the state-of-art ones, leading to 4 times less precomputations and about 2 times less operations. FPGA implementations of our algorithm are presented, with area r...
متن کاملHardware and Software Implementations of RSA Encryption Using Fast Montgomery Modular Multiplication
With the heightened emphasis on security in realm of computers and computer networks, the RSA encryption algorithm has seen world-wide use as an effective method to encrypt and protect data. This key-based algorithm relies heavily on integer multiplication to perform the data encryption or decryption, with the speed of the multiplication algorithm contributing heavily to the throughput performa...
متن کاملComparison of Scalable Montgomery Modular Multiplication Implementations Embedded in Reconfigurable Hardware
Miloš DRUTAROVSKÝ, Martin ŠIMKA, Viktor FISCHER Department of Electronics and Multimedia Communications, Technical University of Košice, Park Komenského 13, 041 20 Košice, Slovak Republic, E-mail: {Milos.Drutarovsky, Martin.Simka}@tuke.sk Laboratoire Traitement du Signal et Instrumentation, Unité Mixte de Recherche CNRS 5516, Université Jean Monnet, 10, rue Barrouin, 42000 Saint-Etienne, France...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولOverlap-free Karatsuba-Ofman Polynomial Multiplication Algorithms for Hardware Implementations
We describe how a simple way to split input operands allows for fast VLSI implementations of subquadratic GF (2)[x] Karatsuba-Ofman multipliers. The theoretical XOR gate delay of the resulting multipliers is reduced significantly. For example, it is reduced by about 33% and 25% for n = 2 and n = 3 (t > 1), respectively. To the best of our knowledge, this parameter has never been improved since ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of information security and applications
سال: 2021
ISSN: ['2214-2134', '2214-2126']
DOI: https://doi.org/10.1016/j.jisa.2021.102770